منابع مشابه
Formally self-dual additive codes over F4
We introduce a class of formally self-dual additive codes over F4 as a natural analogue of binary formally self-dual codes, which is missing in the study of additive codes over F4. We define extremal formally self-dual additive codes over F4 and classify all such codes. Interestingly, we find exactly three formally self-dual additive (7, 27) odd codes over F4 with minimum distance d = 4, a bett...
متن کاملNew extremal binary self-dual codes from F4+uF4-lifts of quadratic circulant codes over F4
In this work, quadratic double and quadratic bordered double circulant constructions are applied to F4 + uF4 as well as F4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension theorems as well as the ring extension version are used to obtain 7 extremal self-dual binary codes of length 58, 24 extremal self-dual binary codes of length 66 and...
متن کاملClassification of Self-Orthogonal Codes over F3 and F4
Several methods for classifying self-orthogonal codes up to equivalence are presented. These methods are used to classify self-orthogonal codes with largest possible minimum distance over the fields F3 and F4 for lengths n ≤ 29 and small dimensions (up to 6). Some properties of the classified codes are also presented. In particular, an extensive collection of quantum error-correcting codes is o...
متن کاملCyclic Codes Over Z4 of Even Length
We determine the structure of cyclic codes over Z4 for arbitrary even length giving the generator polynomial for these codes. We determine the number of cyclic codes for a given length. We describe the duals of the cyclic codes, describe the form of cyclic codes that are self-dual and give the number of these codes. We end by examining specific cases of cyclic codes, giving all cyclic self-dual...
متن کاملCombinatorial polarization, code loops, and codes of high level
We first find the combinatorial degree of any map f : V → F where F is a finite field and V is a finite-dimensional vector space over F . We then simplify and generalize a certain construction due to Chein and Goodaire that was used in characterizing code loops as finite Moufang loops that posses at most two squares. The construction yields binary codes of high divisibility level with prescribe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1988
ISSN: 0021-8693
DOI: 10.1016/0021-8693(88)90054-3